A new formulation and algorithm for the maximum leaf spanning tree problem with an application in forest fire detection

This article proposes a new formulation for the maximum leaf spanning tree problem (MLSTP) using network flow concepts to ensure graph connectivity of problem’s solutions. Since MLSTP is NP hard, genetic algorithm (MGA) also developed solve large-scale instances. The proposed optimally solved 37 out 41 instances existing benchmarks, comparable with results available formulations in literature. MGA all benchmarks less than 1 min without significant optimality gap. found qualified solutions up 2000 vertices reasonable time. As realistic application MLSTP, forest fire detection system was and successfully simulated Iranian Arasbaran wireless sensor (WSN). used find optimal topology WSN responsible early timely warning fires Arasbaran.